Focused Simulated Annealing Search: an Application to Job-shop Scheduling

This paper presents a simulated annealing search procedure developed to solve job shop scheduling problems simultaneously subject to tardiness and inventory costs. The procedure is shown to signi cantly increase schedule quality compared to multiple combinations of dispatch rules and release policies, though at the expense of intense computational e orts. A meta-heuristic procedure is developed that aims at increasing the e ciency of simulated annealing by dynamically in ating the costs associated with major ine ciencies in the current solution. Three di erent variations of this procedure are considered. One of these variations is shown to yield signi cant reductions in computation time, especially on problems where search is more likely to get trapped in local minima. We analyze why this variation of the meta-heuristic is more e ective than the others.